A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
نویسنده
چکیده
The Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e., interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. To answer queries, we provide a novel and simple top-down procedure.
منابع مشابه
Query Answering under the Any-World Assumption for Normal Logic Programs
Recently, in (Loyer & Straccia 2005) the Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e. interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. Whil...
متن کاملQuery Answering in Normal Logic Programs Under Uncertainty
We present a simple, yet general top-down query answering procedure for normal logic programs over lattices and bilattices, where functions may appear in the rule bodies. Its interest relies on the fact that many approaches to paraconsistency and uncertainty in logic programs with or without non-monotonic negation are based on bilattices or lattices, respectively.
متن کاملUncertainty Management in Logic Programming: Simple and Effective Top-Down Query Answering
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certainty lattice; (ii) computable functions may appear in the rule bodies to manipulate certainties; and (iii) we solve the problem by a reduction to an equational systems, for which we device a top-down procedure.
متن کاملcplint and PITA
cplint consists of three Prolog modules for answering queries using goal-oriented procedures. lpadsld.pl: computes the probability of a query using the top-down procedure described in in [5] and [6]. It is based on SLDNF resolution and is an adaptation of the interpreter for ProbLog [2]. lpad.pl: computes the probability of a query using a top-down procedure based on SLG resolution [1]. As a co...
متن کاملLayered Models Top-Down Querying of Normal Logic Programs
For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledge bases. Additionally, abductive reasoning on demand is intrinsically a top-down search method. A query-solving engine is thus highly desirable. The current standard 2-valued semantics for Normal Logic Programs (NLPs), the Stab...
متن کامل